On Higher Order Voronoi Diagrams of Line Segments
نویسندگان
چکیده
We analyze structural properties of the order-k Voronoi diagram of line segments, which surprisingly has not received any attention in the computational geometry literature. We show that order-k Voronoi regions of line segments may be disconnected; in fact a single orderk Voronoi region may consist of Ω(n) disjoint faces. Nevertheless, the structural complexity of the order-k Voronoi diagram of non-intersecting segments remains O(k(n − k)) similarly to points. For intersecting line segments the structural complexity remains O(k(n− k)) for k ≥ n/2.
منابع مشابه
New Results on Abstract Voronoi Diagrams
Voronoi diagrams are a fundamental structure used in many areas of science. For a given set of objects, called sites, the Voronoi diagram separates the plane into regions, such that points belonging to the same region have got the same nearest site. This definition clearly depends on the type of given objects, they may be points, line segments, polygons, etc. and the distance measure used. To f...
متن کاملLine voronoi diagram based interpolation and application to digital terrain modelling
Local coordinates based on the Voronoi diagram are used in natural neighbour interpolation to quantify the “neighbourliness” of data sites. In an earlier paper, we have extended the natural neighbour or stolen area interpolation technique from ordinary Voronoi diagrams to Voronoi diagrams for sets of points and line segments, by providing direct vectorial formulas for the first order and second...
متن کاملA Note on Higher Order Voronoi Diagrams
In this note we prove some facts about the number of segments of a bisector of two sites that are used in a higher order Voronoi diagram. CR Classification: F.2.1
متن کاملHigher Order City Voronoi Diagrams
We investigate higher-order Voronoi diagrams in the city metric. This metric is induced by quickest paths in the L1 metric in the presence of an accelerating transportation network of axis-parallel line segments. For the structural complexity of k-order city Voronoi diagrams of n point sites, we show an upper bound of O(k(n − k) + kc) and a lower bound of Ω(n+ kc), where c is the complexity of ...
متن کاملPolyline-sourced Geodesic Voronoi Diagrams on Triangle Meshes
This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line segments, hyperbolic segments and paraboli...
متن کامل